#define _CRT_SECURE_NO_WARNINGS 1
#include "Sort.h"


InsertTest()
{
	int a[] = { 5,7,4,3,2,9,6,1,8,5,10 };
	Print(a, sizeof(a) / sizeof(int));
	InsertSort(a, sizeof(a) / sizeof(int));
	Print(a, sizeof(a) / sizeof(int));
}

ShellTest()
{
	int a[] = { 5,7,4,3,2,9,6,1,8,5,10 };
	Print(a, sizeof(a) / sizeof(int));
	ShellSort(a, sizeof(a) / sizeof(int));
	Print(a, sizeof(a) / sizeof(int));

}

void SelectTest()
{
	int a[] = { 0,1,2,6,5,3,3,7,8,9 };
	Print(a, sizeof(a) / sizeof(int));
	SelectSort(a, sizeof(a) / sizeof(int));
	Print(a, sizeof(a) / sizeof(int));

}

void HeapTest()
{
	int a[] = { 6,1,2,6,5,3,3,7,8,9 };
	Print(a, sizeof(a) / sizeof(int));
	HeapSort(a, sizeof(a) / sizeof(int));
	Print(a, sizeof(a) / sizeof(int));

}
void BubbleTest()
{

	int a[] = { 0,1,2,6,5,3,3,7,8,9 };
	Print(a, sizeof(a) / sizeof(int));
	BubbleSort(a, sizeof(a) / sizeof(int));
	Print(a, sizeof(a) / sizeof(int));

}
void QuickTest()
{
	int a[] = { 0,1,2,6,5,3,3,7,8,9 };
	Print(a, sizeof(a) / sizeof(int));
	//QuickSort1(a,0,9);
	//QuickSort2(a, 0, 9);
	QuickSort(a, 0, 9);
//	PartSort1(a, 0, 9);
	Print(a, sizeof(a) / sizeof(int));
}
void QuickTest2()
{
	int a[] = { 0,1,2,6,5,3,3,7,8,9 };
	Print(a, sizeof(a) / sizeof(int));
	//QuickSort1(a,0,9);
	//QuickSort2(a, 0, 9);
	QuickSortNon(a, 0, 9);
	//	PartSort1(a, 0, 9);
	Print(a, sizeof(a) / sizeof(int));
}
void MergeTest()
{
	int a[] = { 0,1,2,6,5,3,3,7,8,9 };
	Print(a, sizeof(a) / sizeof(int));
	//QuickSort1(a,0,9);
	//QuickSort2(a, 0, 9);
	MergeSort(a,9);
	//	PartSort1(a, 0, 9);
	Print(a, sizeof(a) / sizeof(int));
}

void TestOP()
{
	srand(time(0));
	const int N = 1000000;
	int* a1 = (int*)malloc(sizeof(int) * N);
	int* a2 = (int*)malloc(sizeof(int) * N);
	int* a3 = (int*)malloc(sizeof(int) * N);
	int* a4 = (int*)malloc(sizeof(int) * N);
	int* a5 = (int*)malloc(sizeof(int) * N);
	int* a6 = (int*)malloc(sizeof(int) * N);
	int* a7 = (int*)malloc(sizeof(int) * N);
	int* a8 = (int*)malloc(sizeof(int) * N);

	for (int i = 0; i < N; ++i)
	{
		a1[i] = rand();
		a2[i] = a1[i];
		a3[i] = a1[i];
		a4[i] = a1[i];
		a5[i] = a1[i];
		a6[i] = a1[i];
		a7[i] = a1[i];
		a8[i] = a1[i];

	}
	int begin1 = clock();
	//InsertSort(a1, N);
	int end1 = clock();
	int begin2 = clock();
	//ShellSort(a2, N);
	int end2 = clock();
	int begin3 = clock();
	//SelectSort(a3, N);
	int end3 = clock();
	int begin4 = clock();
	HeapSort(a4, N);
	int end4 = clock();
	int begin5 = clock();
	QuickSort(a5, 0, N - 1);
	int end5 = clock();
	int begin6 = clock();
	QuickSort2(a6, 0, N - 1);
	int end6 = clock();
	int begin7 = clock();
	QuickSort3(a7, 0, N - 1);
	int end7 = clock();
	int begin8 = clock();
	PartSort1(a8, 0, N - 1);
	//MergeSort(a6, N);
	int end8 = clock();
	printf("InsertSort:%d\n", end1 - begin1);
	printf("ShellSort:%d\n", end2 - begin2);
	printf("SelectSort:%d\n", end3 - begin3);
	printf("HeapSort:%d\n", end4 - begin4);
	printf("QuickSort:%d\n", end5 - begin5);
	printf("QuickSort2:%d\n", end6 - begin6);
	printf("QuickSort3:%d\n", end7 - begin7);

	//printf("MergeSort:%d\n", end6 - begin6);
	free(a1);
	free(a2);
	free(a3);
	free(a4);
	free(a5);
	free(a6);
}
int main()
{
	//InsertTest();
	//ShellTest();
	//SelectTest();
	//HeapTest();
	//	BubbleTest();
	//QuickTest();
	//TestOP();
	//QuickTest2();
	MergeTest();

	return 0;
}
